Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling
نویسندگان
چکیده
Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances among their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams. We propose a formulation of the home-away assignment problem as an integer program, and a rounding algorithm based on Bertsimas, Teo and Vohra’s dependent randomized rounding method [2]. Computational experiments show that our method quickly generates feasible solutions close to optimal. key words: sports scheduling, timetabling, approximation algorithm, dependent randomized rounding
منابع مشابه
The Home-away Assignment Problems and Break Minimization/maximization Problems in Sports Scheduling
Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances between their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams; the break minimization/maximization problem is to find a home-away assignment that minimizes/maximizes the number of breaks, i.e., the number of occurre...
متن کاملLP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
We consider a scheduling problem on unrelated parallel machines with the objective to minimize the makespan. In addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource, e.g. workers. A given amount of that resource can be distributed over the jobs in process at any time. The more of the resource is allocated to a job, the small...
متن کاملSemidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling
For a given schedule of a round-robin tournament and a matrix of distances between homes of teams, an optimal home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance. We propose a technique to transform the problem to MIN RES CUT. We apply Goemans and Williamson’s 0.878-approximation algorithm for MAX RES CUT, which is based on a positive semid...
متن کاملSports tournaments, home-away assignments, and the break minimization problem
We consider the break minimization problem for fixing home-away assignments in round-robin sports tournaments. First, we show that for an opponent schedule with n teams and n− 1 rounds, there always exists a home-away assignment with at most 1 4n(n−2) breaks. Secondly, for infinitely many n, we construct opponent schedules for which at least 6n(n−1) breaks are necessary. Finally, we prove that ...
متن کاملEfficient Approximation Algorithms for Scheduling Unrelated Parallel Machines
Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1, .., n to m machines i = 1, .., m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective is to minimize the makespan of the schedule. SUM is an NP-hard problem even when the number of machines is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 89-A شماره
صفحات -
تاریخ انتشار 2006